Typed Reductions of CLS

نویسنده

  • Livio Bioglio
چکیده

The calculus of looping sequences is a formalism for describing the evolution of biological systems by means of term rewriting rules. We enrich this calculus with a type discipline, derived from the requirement of certain elements and the repellency of others, and a type semantic, based on rules respecting different biological properties.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Comparison of Typed and Handwritten Essays of Iranian EFL Students in terms of Length, Spelling, and Grammar

This study attempted to compare typed and handwritten essays of Iranian EFL students in terms of length, spelling, and grammar. To administer the study, the researchers utilized Alice Touch Typing Tutor software to select 15 upper intermediate students with higher ability to write two essays: one typed and the other handwritten. The students were both males and females between the ages of 22 to...

متن کامل

Medical students points of view on clinical skill lab function in 8 month period

Introduction. Considering rights of patients and presence of a need for a standard clinical skills learning setting in recent 3 decades, it seems necessary to encourage decision – makers of medical education to establish clinical skills laboratory, in order to minimize unnecessary practices and possible injuries and reduce stress over students. CLS in TUMS was established in 2001. In planning...

متن کامل

Discovering Needed Reductions Using Type Theory

The identiication of the needed redexes in a term is an undecidable problem. We introduce a (partially decidable) type assignment system, which distinguishes certain redexes called the allowable redexes. For a well-typed term e, allowable redexes are needed redexes. In addition, with principal typing, all the needed redexes of a normalisable term are allowable. Using these results, we can ident...

متن کامل

Monad Translating Inductive and Coinductive Types

We show that the call-by-name monad translation of simply typed lambda calculus extended with sum and product types extends to special and general inductive and coinductive types so that its crucial property of preserving typings and βand commuting reductions is maintained. Specific similar-purpose translations such as CPS translations follow from the general monad translations by specializatio...

متن کامل

Extensional Isomorphisms of Inductive Types in Simply-Typed Lambda-Calculus

We study isomorphisms of types in the system of simply-typed λ-calculus with inductive types and recursion. It is shown that in some cases (multiproducts, copies of types), it is possible to add new reductions in such a way that strong normalisation and confluence of the calculus is preserved, and the isomorphisms may be regarded as intensional w.r.t. a stronger equality relation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009